Decomposing Sets of Inversions

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decomposing Sets of Inversions

In this paper we consider the question how the set of inversions of a permutation π ∈ Sn can be partitioned into two subsets, which are themselves inversion sets of permutations in Sn. Our method is to study the modular decomposition of the inversion graph of π. A correspondence to the substitution decomposition of π is also given. Moreover, we consider the special case of multiplicative decomp...

متن کامل

Sets and Posets with Inversions

We investigate unary operations ∨, ∧ and ♦ on a set X satisfying x = x∨∨ = x∧∧ and x♦ = x∨∧ = x∧∨ for all x ∈ X. Moreover, if in particular X is a meet-semilattice, then we also investigate the operations defined by x = x ∧ x∨, x = x ∧ x∧, x = x ∧ x♦; x• = x∨ ∧ x∧, x♣ = x∨ ∧ x♦, x♠ = x∧ ∧ x♦; and x = x ∧ x∨ ∧ x∧ ∧ x♦ for all x ∈ X. Our prime example for this is the set-lattice P(U × V ) of all ...

متن کامل

Decomposing numerical ranges along with spectral sets

This note is to indicate the new sphere of applicability of the method developed by Mlak as well as by the author. Restoring those ideas is summoned by current developments concerning K-spectral sets on numerical ranges. The decomposition of numerical ranges the title refers to is, see [13, p. 42], W(A⊕B) = conv(W(A) ∪ W(B)); (1) it can be proved for any two Hilbert space operators A and B. The...

متن کامل

Jump inversions inside effectively closed sets and applications to randomness

We study inversions of the jump operator on Π1 classes, combined with certain basis theorems. These jump inversions have implications for the study of the jump operator on the random degrees—for various notions of randomness. For example, we characterize the jumps of the weakly 2-random sets which are not 2-random, and the jumps of the weakly 1-random relative to 0′ sets which are not 2-random....

متن کامل

Sierpinski Carpets as Julia sets for Imaginary 3-Circle Inversions

sends the point z ∈ C to its inversion image about the circle of radius r ∈ R centered at the point a ∈ C. Dynamically, this map is not interesting since iterating twice yields the identity mapping. Using three circles we invert a point z about each circle and form a new map by sending z to the arithmetic mean of the three inversion images. We refer to this as inverting z about the three circle...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Electronic Journal of Combinatorics

سال: 2013

ISSN: 1077-8926

DOI: 10.37236/2609